A bad example for the iterative rounding method for mincost k-connected spanning subgraphs
نویسندگان
چکیده
Jain’s iterative rounding method and its variants give the best approximation guarantees known for many problems in the area of network design. The method has been applied to the mincost k-connected spanning subgraph problem, but the approximation guarantees given by the method are weak. We construct a family of examples such that the standard LP relaxation has an extreme point solution with infinity norm ≤ Ω(1)/ √ k, thus showing that the standard iterative rounding method cannot achieve an approximation guarantee better than Ω( √ k).
منابع مشابه
Approximating Minimum Cost Connectivity Orientation and Augmentation
Connectivity augmentation and orientation are two fundamental classes of problems related to graph connectivity. The former includes minimum cost spanning trees, k-edge-connected subgraph and more generally, survivable network design problems [9]. In the orientation problems the goal is to find orientations of an undirected graph that achieve prescribed connectivity properties such as global an...
متن کاملGenerating k-Vertex Connected Spanning Subgraphs and k-Edge Connected Spanning Subgraphs
We show that k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k. We also show that generating k-edge connected spanning subgraphs, where k is part of the input, can be done in incremental polynomial time. These results are based on properties of minimally k-connected graphs which might be of independent interest.
متن کاملSurvivable Network Design with Degree or Order
We present algorithmic and hardness results for network design problems with degree or order constraints. The first problem we consider is the Survivable Network Design problem with degree constraints on vertices. The objective is to find a minimum cost subgraph which satisfies connectivity requirements between vertices and also degree upper bounds Bv on the vertices. This includes the well-stu...
متن کاملGenerating 3-vertex connected spanning subgraphs
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial time, i.e., for every K we can generate K (or all) minimal 3-vertex connected spanning subgraphs of a given graph in O(K2log(K)m2 +K2m3) time, where n and m are the number of vertices and edges of the input graph, respec...
متن کاملOn Generation of Cut Conjunctions, Minimal K-connected Spanning Subgraphs, Minimal Connected and Spanning Subsets and Vertices
OF THE DISSERTATION On Generation of Cut Conjunctions, Minimal k-Connected Spanning Subgraphs, Minimal Connected and Spanning Subsets and Vertices by Konrad Borys Dissertation Director: Professor Endre Boros We consider the following problems: • Cut conjunctions in graphs: given an undirected graphG = (V,E) and a collection of vertex pairs B ⊆ V × V generate all minimal edge sets X ⊆ E such tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Optimization
دوره 10 شماره
صفحات -
تاریخ انتشار 2013